CODE 122. String to Integer (atoi)

版权声明:本文为博主原创文章,转载请注明出处,谢谢!

版权声明:本文为博主原创文章,转载请注明出处:http://blog.jerkybible.com/2013/11/12/2013-11-12-CODE 122 String to Integer (atoi)/

访问原文「CODE 122. String to Integer (atoi)

Implement atoi to convert a string to an integer.
Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases.
Notes: It is intended for this problem to be specified vaguely (ie, no given input specs). You are responsible to gather all the input requirements up front.
spoilers alert… click to show requirements for atoi.
Requirements for atoi:The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from this character, takes an optional initial plus or minus sign followed
by as many numerical digits as possible, and interprets them as a numerical value.
The string can contain additional characters after those that form the integral number, which are ignored and have no effect on the behavior of this function.
If the first sequence of non-whitespace characters in str is not a valid integral number, or if no such sequence exists because either str is empty or it contains only whitespace characters, no conversion is performed.
If no valid conversion could be performed, a zero value is returned. If the correct value is out of the range of representable values, INT_MAX (2147483647) or INT_MIN (-2147483648) is returned.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
public int atoi(String str) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
if (null == str || "".equals(str)) {
return 0;
}
char[] strs = str.toCharArray();
int begin = 0;
boolean ism = false;
while (begin < strs.length && strs[begin] == ' ') {
begin++;
}
if (begin >= strs.length) {
return 0;
}
if (strs[begin] == '+') {
begin++;
} else if (strs[begin] == '-') {
ism = true;
begin++;
}
long number = 0;
for (int i = begin; i < strs.length; i++) {
if (strs[i] < '0' || strs[i] > '9') {
if (i == begin) {
return 0;
} else {
break;
}
} else {
number = Character.digit(strs[i], 10) + 10 * number;
if (!ism && number > Integer.MAX_VALUE) {
return Integer.MAX_VALUE;
} else if (ism && number - 1 > Integer.MAX_VALUE) {
return Integer.MIN_VALUE;
}
}
}
if (ism) {
number = -number;
}
return (int) number;
}
Jerky Lu wechat
欢迎加入微信公众号